Computability and uncountable Linear Orders II: degree spectra
نویسندگان
چکیده
We study the computable structure theory of linear orders of size א1 within the framework of admissible computability theory. In particular, we study degree spectra and the successor relation.
منابع مشابه
Computability and uncountable Linear Orders I: Computable Categoricity
We study the computable structure theory of linear orders of size א1 within the framework of admissible computability theory. In particular, we characterize which of these linear orders are computably categorical.
متن کاملSpaces of orders and their Turing degree spectra
We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left order on a group G is a linear order of the domain of G, which is left-invariant under the group operation. Right orders and bi-orders are defined similarly. In particular, we study groups for which the spaces of left orders are homeomorphic to the Cantor set, and their T...
متن کاملUncountable Linear Orders
Two important classes of linear orders that are not σ-scattered are the real types and the Aronszajn types: the real types are those uncountable dense linear orders that are separable; the Aronszajn types are those linear orders that are uncountable and yet have no uncountable suborders that are scattered or real types. This latter class was considered—and proved nonempty—long ago by Aronszajn ...
متن کاملComputably Enumerable Partial Orders
We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for such orders, and show that the latter is strictly stronger than the latter. We then show that every ∅′-computable structure (or even just of c.e. degree) has ...
متن کاملCharacterization of some projective special linear groups in dimension four by their orders and degree patterns
Let $G$ be a finite group. The degree pattern of $G$ denoted by $D(G)$ is defined as follows: If $pi(G)={p_{1},p_{2},...,p_{k}}$ such that $p_{1}
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 80 شماره
صفحات -
تاریخ انتشار 2015